Large non-planar graphs and an application to crossing-critical graphs
نویسندگان
چکیده
منابع مشابه
Large non-planar graphs and an application to crossing-critical graphs
We prove that, for every positive integer k, there is an integer N such that every 4-connected non-planar graph with at least N vertices has a minor isomorphic to K4,k, the graph obtained from a cycle of length 2k + 1 by adding an edge joining every pair of vertices at distance exactly k, or the graph obtained from a cycle of length k by adding two vertices adjacent to each other and to every v...
متن کاملCrossing-critical graphs with large maximum degree
A conjecture of Richter and Salazar about graphs that are critical for a fixed crossing number k is that they have bounded bandwidth. A weaker well-known conjecture is that their maximum degree is bounded in terms of k. In this note we disprove these conjectures for every k ≥ 171, by providing examples of k-crossing-critical graphs with arbitrarily large maximum degree. A graph is k-crossing-cr...
متن کاملcommuting and non -commuting graphs of finit groups
فرض کنیمg یک گروه غیر آبلی متناهی باشد . گراف جابجایی g که با نماد نمایش داده می شود ،گرافی است ساده با مجموعه رئوس که در آن دو راس با یک یال به هم وصل می شوند اگر و تنها اگر . مکمل گراف جابجایی g راگراف نا جابجایی g می نامیم.و با نماد نشان می دهیم. گرافهای جابجایی و ناجابجایی یک گروه متناهی ،اولین بار توسطاردوش1 مطرح گردید ،ولی در سالهای اخیر به طور مفصل در مورد بحث و بررسی قرار گرفتند . در ،م...
15 صفحه اولNew Infinite Families of Almost-Planar Crossing-Critical Graphs
We show that, for all choices of integers k > 2 and m, there are simple 3connected k-crossing-critical graphs containing more than m vertices of each even degree ≤ 2k − 2. This construction answers one half of a question raised by Bokal, while the other half asking analogously about vertices of odd degrees at least 7 in crossing-critical graphs remains open. Furthermore, our newly constructed g...
متن کاملNested cycles in large triangulations and crossing-critical graphs
We show that every sufficiently large plane triangulation has a large collection of nested cycles that either are pairwise disjoint, or pairwise intersect in exactly one vertex, or pairwise intersect in exactly two vertices. We apply this result to show that for each fixed positive integer k, there are only finitely many k-crossing-critical simple graphs of average degree at least six. Combined...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2011
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2010.12.001